Перевод: с русского на английский

с английского на русский

pairwise compactness

См. также в других словарях:

  • Johannes De Groot — (May 7, 1914 – September 11, 1972) was a Dutch mathematician, the leading Dutch topologist for more than two decades following World War II.citation|title=Handbook of the History of General Topology|editor1 first=Charles E.|editor1… …   Wikipedia

  • Orthogonality — The line segments AB and CD are orthogonal to each other. Orthogonality occurs when two things can vary independently, they are uncorrelated, or they are perpendicular. Contents 1 Mathematics …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of …   Wikipedia

  • Group action — This article is about the mathematical concept. For the sociology term, see group action (sociology). Given an equilateral triangle, the counterclockwise rotation by 120° around the center of the triangle acts on the set of vertices of the… …   Wikipedia

  • Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

  • Spectral theorem — In mathematics, particularly linear algebra and functional analysis, the spectral theorem is any of a number of results about linear operators or about matrices. In broad terms the spectral theorem provides conditions under which an operator or a …   Wikipedia

  • Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… …   Wikipedia

  • Locally connected space — In this topological space, V is a neighbourhood of p and it contains a connected neighbourhood (the dark green disk) that contains p. In topology and other branches of mathematics, a topological space X is locally connected if every point admits… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»